package cn.pugle.oj.leetcode;

import cn.pugle.oj.catalog.DynamicProblem;

/**
 * TODO
 * 任意次买卖 DP法
 * see 123 188
 *
 * @author tzp
 * @since 2020/9/18
 */
public class LC122_1 implements DynamicProblem {
    public int maxProfit(int[] prices) {
        if (prices == null || prices.length <= 1) return 0;
        int[][] state = new int[prices.length][prices.length];
        for (int i = 0; i < prices.length; i++) {
            for (int j = i; j < prices.length; j++) {
                if (i == j) {
                    state[i][j] = 0;
                } else {

                }
            }
        }
        return 0;
    }

    public static void main(String[] args) {
        System.out.println(new LC122_1().maxProfit(new int[]{7, 1, 5, 3, 6, 4}));
        System.out.println(new LC122_1().maxProfit(new int[]{7, 6, 5, 4}));
        System.out.println(new LC122_1().maxProfit(new int[]{7, 6, 5, 4, 5}));
    }
}
